Syntax-Tree Regular Expression Based DFA FormalConstruction
نویسندگان
چکیده
منابع مشابه
Syntax-Tree Regular Expression Based DFA FormalConstruction
Compiler is a program whose functionality is to translate a computer program written in source language into an equivalent machine code. Compiler construction is an advanced research area because of its size and complexity. The source codes are in higher level languages which are usually complex and, consequently, increase the level of abstraction. Due to such reasons, design and construction o...
متن کاملSDFA: Series DFA for Memory-Efficient Regular Expression Matching
Regular expression (RegEx) matching plays an important role in various network, security and database applications. Deterministic finite automata (DFA) is the preferred representation to achieve online RegEx matching in backbone networks, because of its one single pass over inputs for multiple RegExes and guaranteed performance of O(1) memory bandwidth per symbol. However, DFA may occupy prohib...
متن کاملAlgorithm to Generate DFA for AND-operator in Regular Expression
For the past time a number of algorithms were presented to produce a deterministic finite automaton (DFA) for the regular expression. These algorithms could be divided into what they used as an initial data from which to produce DFA. The method to produce DFA from non-deterministic finite automaton (NFA) by a subset construction could be generalized for extended regular expressions, including i...
متن کاملCompact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speciic properties of Glushkov's nondeterministic nite automaton (NFA) construction algorithm, we are able to encode the DFA using (m + 1)(2 m+1 + jj) bits, where m is the number of characters (excluding operator symbols) in the regular expression and is the alphabet. This compares favorably against the wors...
متن کاملMinimalist Syntax, Multiple Regular Tree Grammars and Direction Preserving Tree Transductions1
Model-theoretic syntax deals with the logical characterization of complexity classes. The first results in this area were obtained in the early and late Sixties of the last century. In these results it was established that languages recognised by finite string and tree automata are definable by means of monadic second-order logic (MSO). To be slightly more precise, the classical results, just m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Information Management
سال: 2012
ISSN: 2160-5912,2160-5920
DOI: 10.4236/iim.2012.44021